Abstraction of Systems with Counters for Symbolic Model Checking
نویسندگان
چکیده
ion of Systems with Counters for Symbolic Model Checking Klaus Schneider and George Logothetis University of Karlsruhe, Department of Computer Science, Institute for Computer Design and Fault Tolerance (Prof. Dr.-Ing. D. Schmid), P.O. Box 6980, 76128 Karlsruhe, Germany, email: {Klaus.Schneider,George.Logothetis}@informatik.uni-karlsruhe.de, http://goethe.ira.uka.de/ Abstract Model checking of temporal logics has become a standard technique for the verification of finite state reactive systems. However, these procedures suffer from the so-called state explosion problem which limits their practical use. Therefore, appropriate abstractions have to be applied to reduce the state space if these tools are to be applied to real-world problems. In particular, counters are hard to verify with model checking procedures. Hence, we present in this paper a special abstraction technique for counters that leads to very small, and in particular finite, state spaces. The method even allows in many cases to verify generic systems without interactive theorem proving, i.e. without induction. As counters are often used for the implementation of control systems, the method presented here is of essential importance for the verification of these systems.Model checking of temporal logics has become a standard technique for the verification of finite state reactive systems. However, these procedures suffer from the so-called state explosion problem which limits their practical use. Therefore, appropriate abstractions have to be applied to reduce the state space if these tools are to be applied to real-world problems. In particular, counters are hard to verify with model checking procedures. Hence, we present in this paper a special abstraction technique for counters that leads to very small, and in particular finite, state spaces. The method even allows in many cases to verify generic systems without interactive theorem proving, i.e. without induction. As counters are often used for the implementation of control systems, the method presented here is of essential importance for the verification of these systems.
منابع مشابه
Symbolic Counter Abstraction for Concurrent Software
Abstract. The trend towards multi-core computing has made concurrent software an important target of computer-aided verification. Unfortunately, Model Checkers for such software suffer tremendously from combinatorial state space explosion. We show how to apply counter abstraction to real-world concurrent programs to factor out redundancy due to thread replication. The traditional global state r...
متن کاملContext-aware counter abstraction
The trend towards multi-core computing has made concurrent software an important target of computer-aided verification. Unfortunately, Model Checkers for such software suffer tremendously from combinatorial state space explosion. We show how to apply counter abstraction to real-world concurrent programs to factor out redundancy due to thread replication. The traditional global state representat...
متن کاملNeuro-ACT Cognitive Architecture Applications in Modeling Driver’s Steering Behavior in Turns
Cognitive Architectures (CAs) are the core of artificial cognitive systems. A CA is supposed to specify the human brain at a level of abstraction suitable for explaining how it achieves the functions of the mind. Over the years a number of distinct CAs have been proposed by different authors and their limitations and potentials were investigated. These CAs are usually classified as symbolic and...
متن کاملBoom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent variant of counter abstraction, where thread counters are used in a program-context aware way. While designed for bounded counters, this method also integrates well with the Karp-Miller tree construction for vector ad...
متن کاملSymbolic Execution and Model Checking for Testing
Subsumption • Symbolic execution with subsumption checking – Not enough to ensure termination – An infinite number of symbolic states • Our solution – Abstraction • Store abstract versions of explored symbolic states • Subsumption checking to determine if an abstract state is re-visited • Decide if the search should continue or backtrack – Enables analysis of under-approximation of program beha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999